Genomic Sequence Analysis: A Case Study in Constrained Heaviest Segments (Working draft)
نویسنده
چکیده
Methods for genomic sequence analysis have been studied for more than a decade. One line of investigation is to locate the biologically meaningful segments, like conserved regions or GC-rich regions in DNA sequences. A common approach is to assign a real number (also called scores) to each residue, and then look for the maximum-sum or maximum-average segment. In this chapter, we address a few interesting applications concerning the search for the “heaviest” segment of a numerical sequence that naturally arises in the biomolecular sequence analysis. We also introduce some fundamental algorithmic techniques for solving them.
منابع مشابه
Constrained Heaviest Segments in a Number Sequence and Their Applications in Biomolecular Sequence Analysis (Working Draft)
متن کامل
Efficient Algorithms for Locating the Length-Constrained Heaviest Segments, with Applications to Biomolecular Sequence Analysis
We study two fundamental problems concerning the search for interesting regions in sequences: (i) given a sequence of real numbers of length n and an upper bound U , find a consecutive subsequence of length at most U with the maximum sum and (ii) given a sequence of real numbers of length n and a lower bound L, find a consecutive subsequence of length at least L with the maximum average. We pre...
متن کاملIdentification of Human Chromosome Segments that Have High Homology with Rat Genomic DNA
This study was conducted to determine the location of DNA segment with homology to the rat conserved genomic DNA in human chromosomes. The labeled rat genomic DNA was hybridized with normal human (male) metaphases. The study of 74 metaphases after fluorescence in situ hybridization showed 371 twin-spot signals on human chromosomes. Statistical analysis indicated that the specific accumulation o...
متن کاملAlgorithms for the Problems of Length-Constrained Heaviest Segments
We present algorithms for length-constrained maximum sum segment and maximum density segment problems, in particular, and the problem of finding length-constrained heaviest segments, in general, for a sequence of real numbers. Given a sequence of n real numbers and two real parameters L and U (L 6 U), the maximum sum segment problem is to find a consecutive subsequence, called a segment, of len...
متن کاملRepeated Record Ordering for Constrained Size Clustering
One of the main techniques used in data mining is data clustering, which has many applications in computer science, biology, and social sciences. Constrained clustering is a type of clustering in which side information provided by the user is incorporated into current clustering algorithms. One of the well researched constrained clustering algorithms is called microaggregation. In a microaggreg...
متن کامل